Sciweavers

3055 search results - page 108 / 611
» Randomized Search Trees
Sort
View
WWW
2005
ACM
14 years 11 months ago
Focused crawling by exploiting anchor text using decision tree
Focused crawlers are considered as a promising way to tackle the scalability problem of topic-oriented or personalized search engines. To design a focused crawler, the choice of s...
Jun Li, Kazutaka Furuse, Kazunori Yamaguchi
ISCAS
2002
IEEE
94views Hardware» more  ISCAS 2002»
14 years 3 months ago
Minimum power broadcast trees for wireless networks: optimizing using the viability lemma
Wireless multicast/broadcast sessions, unlike wired networks, inherently reaches several nodes with a single transmission. For omnidirectional wireless broadcast to a node, all no...
Robert J. Marks II, Arindam Kumar Das, Mohamed A. ...
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
14 years 10 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...
SODA
2004
ACM
89views Algorithms» more  SODA 2004»
13 years 11 months ago
Interpolation search for non-independent data
We define a deterministic metric of "well-behaved data" that enables searching along the lines of interpolation search. Specifically, define to be the ratio of distance...
Erik D. Demaine, Thouis R. Jones, Mihai Patrascu
IJCBDD
2008
113views more  IJCBDD 2008»
13 years 10 months ago
Parsimony accelerated Maximum Likelihood searches
: Phylogenetic search is a key tool used in a variety of biological research endeavors. However, this search problem is known to be computationally difficult, due to the astronomic...
Kenneth Sundberg, Timothy O'Connor, Hyrum Carroll,...