Sciweavers

1136 search results - page 201 / 228
» Finding Small Holes
Sort
View
CIKM
2006
Springer
14 years 11 days ago
Coupling feature selection and machine learning methods for navigational query identification
It is important yet hard to identify navigational queries in Web search due to a lack of sufficient information in Web queries, which are typically very short. In this paper we st...
Yumao Lu, Fuchun Peng, Xin Li, Nawaaz Ahmed
FOCS
2004
IEEE
14 years 11 days ago
Worst-Case to Average-Case Reductions Based on Gaussian Measures
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
Daniele Micciancio, Oded Regev
ESA
2006
Springer
137views Algorithms» more  ESA 2006»
14 years 9 days ago
Deciding Relaxed Two-Colorability - A Hardness Jump
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
Robert Berke, Tibor Szabó
CASES
2001
ACM
14 years 9 days ago
Transparent data-memory organizations for digital signal processors
Today's digital signal processors (DSPs), unlike general-purpose processors, use a non-uniform addressing model in which the primary components of the memory system--the DRAM...
Sadagopan Srinivasan, Vinodh Cuppu, Bruce L. Jacob
ICSE
2000
IEEE-ACM
14 years 7 days ago
An empirical study of regression test application frequency
Regression testing is an expensive maintenance process used to revalidate modified software. Regression test selection (RTS) techniques attempt to reduce the cost of regression te...
Jung-Min Kim, Adam A. Porter, Gregg Rothermel