Sciweavers

304 search results - page 4 / 61
» Dynamic ordered sets with exponential search trees
Sort
View
ISEC
2001
Springer
180views ECommerce» more  ISEC 2001»
14 years 1 months ago
i-Cube: A Tool-Set for the Dynamic Extraction and Integration of Web Data Content
Over the past decade the Internet has evolved into the largest public community in the world. It provides a wealth of data content and services in almost every field of science, t...
Frankie Poon, Kostas Kontogiannis
DAM
2008
135views more  DAM 2008»
13 years 8 months ago
Edge ranking and searching in partial orders
: We consider a problem of searching an element in a partially ordered set (poset). The goal is to find a search strategy which minimizes the number of comparisons. Ben-Asher, Farc...
Dariusz Dereniowski
SAC
2009
ACM
14 years 3 months ago
Exploiting weak dependencies in tree-based search
In this work, our objective is to heuristically discover a simplified form of functional dependencies between variables called weak dependencies. Once discovered, these relations...
Alejandro Arbelaez, Youssef Hamadi
JCB
2006
91views more  JCB 2006»
13 years 8 months ago
Reverse Engineering Discrete Dynamical Systems from Data Sets with Random Input Vectors
Recently a new algorithm for reverse engineering of biochemical networks was developed by Laubenbacher and Stigler. It is based on methods from computational algebra and finds mos...
Winfried Just
JMLR
2010
135views more  JMLR 2010»
13 years 3 months ago
An Exponential Model for Infinite Rankings
This paper presents a statistical model for expressing preferences through rankings, when the number of alternatives (items to rank) is large. A human ranker will then typically r...
Marina Meila, Le Bao