Sciweavers

1888 search results - page 330 / 378
» Algorithms for Querying by Spatial Structure
Sort
View
DAC
2006
ACM
14 years 8 months ago
SAT sweeping with local observability don't-cares
SAT sweeping is a method for simplifying an AND/INVERTER graph (AIG) by systematically merging graph vertices from the inputs towards the outputs using a combination of structural...
Qi Zhu, Nathan Kitchen, Andreas Kuehlmann, Alberto...
STOC
2001
ACM
151views Algorithms» more  STOC 2001»
14 years 8 months ago
On the cell probe complexity of membership and perfect hashing
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
Rasmus Pagh
GLOBECOM
2007
IEEE
14 years 2 months ago
An Enhanced RFID Multiple Access Protocol for Fast Inventory
- The relevant performance metric for successful deployment of Radio Frequency Identification (RFID) systems for tag inventory applications is the latency for reading all tags with...
You-Chang Ko, Sumit Roy, Joshua R. Smith, Hyung-Wo...
WEBI
2005
Springer
14 years 1 months ago
Standardized Evaluation Method for Web Clustering Results
Finding a set of web pages relevant to a user’s information goal is difficult due to the enormous size of the Internet. Search engines are able to find a set of pages that mat...
Daniel Crabtree, Xiaoying Gao, Peter Andreae
ICDM
2002
IEEE
163views Data Mining» more  ICDM 2002»
14 years 24 days ago
High Performance Data Mining Using the Nearest Neighbor Join
The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such that the r...
Christian Böhm, Florian Krebs