Sciweavers

771 search results - page 67 / 155
» Efficient Web Searching Using Temporal Factors
Sort
View
CSDA
2006
71views more  CSDA 2006»
14 years 10 months ago
Computation of Huber's M-estimates for a block-angular regression problem
Huber's M-estimation technique is applied to a block-angular regression problem, which may arise from some applications. A recursive, modified Newton approach to computing th...
Xiao-Wen Chang
AIPS
2010
14 years 11 months ago
Incrementally Solving STNs by Enforcing Partial Path Consistency
Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constra...
Léon Planken, Mathijs de Weerdt, Neil Yorke...
AI
2002
Springer
14 years 9 months ago
Parallel Randomized Best-First Minimax Search
We describe a novel parallel randomized search algorithm for two-player games. The algorithm is a randomized version of Korf and Chickering's best-first search. Randomization...
Yaron Shoham, Sivan Toledo
ICDM
2005
IEEE
217views Data Mining» more  ICDM 2005»
15 years 3 months ago
Improving Automatic Query Classification via Semi-Supervised Learning
Accurate topical classification of user queries allows for increased effectiveness and efficiency in general-purpose web search systems. Such classification becomes critical if th...
Steven M. Beitzel, Eric C. Jensen, Ophir Frieder, ...
EDBT
2011
ACM
222views Database» more  EDBT 2011»
14 years 1 months ago
The hidden web, XML and the Semantic Web: scientific data management perspectives
The World Wide Web no longer consists just of HTML pages. Our work sheds light on a number of trends on the Internet that go beyond simple Web pages. The hidden Web provides a wea...
Fabian M. Suchanek, Aparna S. Varde, Richi Nayak, ...