2740 search results - page 298 / 548 » Approximating Component Selection |
137
click to vote
CIKM
2003
Springer
15 years 9 months ago
2003
Springer
Searchers can have problems devising queries that accurately express their, often dynamic, information needs. In this paper we describe an adaptive approach that uses unobtrusive ...
126
click to vote
KDD
1998
ACM
15 years 8 months ago
1998
ACM
In this paper we discuss a data mining framework for constructing intrusion detection models. The key ideas are to mine system audit data for consistent and useful patterns of pro...
124
click to vote
COMPGEOM
2001
ACM
15 years 7 months ago
2001
ACM
We propose a new randomized algorithm for maintaining a set of clusters among moving nodes in the plane. Given a specified cluster radius, our algorithm selects and maintains a va...
137
Voted
RSCTC
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. Classic parsing methods are based on complete search techniques to find the different interpretations of a sentence. However, the size of the search space increases expon...
156
click to vote
DEXAW
2007
IEEE
15 years 5 months ago
2007
IEEE
Due to the lack of efficient native XML database management systems, XML data manipulation and query evaluation may be resource-consuming, and represent a bottleneck for several ...