Sciweavers

736 search results - page 80 / 148
» A dynamic data structure for approximate range searching
Sort
View
WEBDB
2005
Springer
129views Database» more  WEBDB 2005»
14 years 2 months ago
Searching for Hidden-Web Databases
Recently, there has been increased interest in the retrieval and integration of hidden Web data with a view to leverage high-quality information available in online databases. Alt...
Luciano Barbosa, Juliana Freire
CVPR
2012
IEEE
11 years 11 months ago
The inverted multi-index
A new data structure for efficient similarity search in very large datasets of high-dimensional vectors is introduced. This structure called the inverted multi-index generalizes ...
Artem Babenko, Victor S. Lempitsky
FGCS
2007
99views more  FGCS 2007»
13 years 8 months ago
Mining performance data for metascheduling decision support in the Grid
: Metaschedulers in the Grid needs dynamic information to support their scheduling decisions. Job response time on computing resources, for instance, is such a performance metric. ...
Hui Li, David L. Groep, Lex Wolters
RECOMB
2007
Springer
14 years 9 months ago
Free Energy Estimates of All-Atom Protein Structures Using Generalized Belief Propagation
We present a technique for approximating the free energy of protein structures using Generalized Belief Propagation (GBP). The accuracy and utility of these estimates are then demo...
Hetunandan Kamisetty, Eric P. Xing, Christopher Ja...
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
14 years 8 months ago
Fast In-Memory XPath Search using Compressed Indexes
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
Diego Arroyuelo, Francisco Claude, Sebastian Manet...