Sciweavers

779 search results - page 82 / 156
» Determining Time of Queries for Re-ranking Search Results
Sort
View
SISAP
2008
IEEE
175views Data Mining» more  SISAP 2008»
16 years 19 days ago
Anytime K-Nearest Neighbor Search for Database Applications
Many contemporary database applications require similarity-based retrieval of complex objects where the only usable knowledge of its domain is determined by a metric distance func...
Weijia Xu, Daniel P. Miranker, Rui Mao, Smriti R. ...
ICMCS
1999
IEEE
145views Multimedia» more  ICMCS 1999»
15 years 10 months ago
A Bandwidth Friendly Search Engine
The Internet plays host to many millions of documents and images and is increasing in size all the time. As a result locating web content is becoming increasingly difficult for us...
Clare Bradford, Ian W. Marshall
CIKM
2004
Springer
15 years 11 months ago
Processing content-oriented XPath queries
Document-centric XML collections contain text-rich documents, marked up with XML tags that add lightweight semantics to the text. Querying such collections calls for a hybrid quer...
Börkur Sigurbjörnsson, Jaap Kamps, Maart...
SIGMOD
2010
ACM
170views Database» more  SIGMOD 2010»
15 years 11 months ago
Querying data provenance
Many advanced data management operations (e.g., incremental maintenance, trust assessment, debugging schema mappings, keyword search over databases, or query answering in probabil...
Grigoris Karvounarakis, Zachary G. Ives, Val Tanne...
DATE
2007
IEEE
117views Hardware» more  DATE 2007»
16 years 18 days ago
Rapid and accurate latch characterization via direct Newton solution of setup/hold times
Characterizing setup/hold times of latches and registers, a crucial component for achieving timing closure of large digital designs, typically occupies months of computation in in...
Shweta Srivastava, Jaijeet S. Roychowdhury