Results 171 to 180 of about 243 (212)
Fluorinated poly(malic acid), a water‐soluble biodegradable polymer, was synthesized and used to stabilize perfluorocarbon‐filled microbubbles with improved stability compared to commercial SonoVue and high ultrasound responsiveness. In vivo, microbubbles exhibited prolonged circulation in mice liver and rat brain.
Claire Spitzlei +14 more
wiley +1 more source
Bioinspired Adaptive Sensors: A Review on Current Developments in Theory and Application
This review comprehensively summarizes the recent progress in the design and fabrication of sensory‐adaptation‐inspired devices and highlights their valuable applications in electronic skin, wearable electronics, and machine vision. The existing challenges and future directions are addressed in aspects such as device performance optimization ...
Guodong Gong +12 more
wiley +1 more source
Ion‐Reconfigurable “N”‐Shaped Antiambipolar Behavior in Organic Electrochemical Transistors
A unique N‐shaped negative differential transconductance (NDT) characteristics is demonstrated in single‐polymer organic electrochemical transistors through a sequential doping–redox–doping process driven by iodide ions. This redox‐driven mechanism enables low‐voltage, ion‐controlled reconfigurability and tunable current modulation, allowing seamless ...
Debdatta Panigrahi +11 more
wiley +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
The Similarity Join Database Operator
2010 IEEE 26th International Conference on Data Engineering (ICDE 2010), 2010Similarity joins have been studied as key operations in multiple application domains, e.g., record linkage, data cleaning, multimedia and video applications, and phenomena detection on sensor networks. Multiple similarity join algorithms and implementation techniques have been proposed.
Walid Aref, Yasin N. Silva
exaly +3 more sources
2008 IEEE 24th International Conference on Data Engineering, 2008
Similarity joins have attracted significant interest, with applications in geographical information systems, astronomy, marketing analyzes, and anomaly detection. However, all the past algorithms, although highly fine-tuned, suffer an output explosion if the query range is even moderately large relative to the local data density.
Brent Bryan +2 more
openaire +1 more source
Similarity joins have attracted significant interest, with applications in geographical information systems, astronomy, marketing analyzes, and anomaly detection. However, all the past algorithms, although highly fine-tuned, suffer an output explosion if the query range is even moderately large relative to the local data density.
Brent Bryan +2 more
openaire +1 more source
Streaming Set Similarity Joins
2021We consider the problem of efficiently answering set similarity joins over streams. This problem is challenging both in terms of CPU cost, because similarity matching is computationally much more expensive than equality comparisons, and memory requirements, due to the unbounded nature of streams.
Lucas Pacífico +1 more
openaire +1 more source
High-dimensional similarity joins
IEEE Transactions on Knowledge and Data Engineering, 2002Many emerging data mining applications require a similarity join between points in a high-dimensional domain. We present a new algorithm that utilizes a new index structure, called the /spl epsi/ tree, for fast spatial similarity joins on high-dimensional points.
Kyuseok Shim +2 more
openaire +2 more sources
Similarity joins for uncertain strings
Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, 2014A string similarity join finds all similar string pairs between two input string collections. It is an essential operation in many applications, such as data integration and cleaning, and has been extensively studied for deterministic strings. Increasingly, many applications have to deal with imprecise strings or strings with fuzzy information in them.
Manish Patil, Rahul Shah 0001
openaire +1 more source
2015
With the increasing ability of current applications to produce and consume more complex data, such as images and geographic information, the similarity join has attracted considerable attention. However, this operator does not consider the relationship among the elements in the answer, generating results with many pairs similar among themselves, which ...
Lúcio F. D. Santos +4 more
openaire +1 more source
With the increasing ability of current applications to produce and consume more complex data, such as images and geographic information, the similarity join has attracted considerable attention. However, this operator does not consider the relationship among the elements in the answer, generating results with many pairs similar among themselves, which ...
Lúcio F. D. Santos +4 more
openaire +1 more source
Proceedings of the VLDB Endowment, 2014
String similarity join is an important operation in data integration and cleansing that finds similar string pairs from two collections of strings. More than ten algorithms have been proposed to address this problem in the recent two decades. However, existing algorithms have not been thoroughly compared under the same experimental framework.
Yu Jiang +3 more
openaire +2 more sources
String similarity join is an important operation in data integration and cleansing that finds similar string pairs from two collections of strings. More than ten algorithms have been proposed to address this problem in the recent two decades. However, existing algorithms have not been thoroughly compared under the same experimental framework.
Yu Jiang +3 more
openaire +2 more sources

