Sciweavers

545 search results - page 59 / 109
» Simultaneous approximation by greedy algorithms
Sort
View
140
Voted
IMC
2006
ACM
15 years 10 months ago
Approximate fingerprinting to accelerate pattern matching
Pattern matching and analysis over network data streams is increasingly becoming an essential primitive of network monitoring systems. It is a fundamental part of most intrusion d...
Ramaswamy Ramaswamy, Lukas Kencl, Gianluca Iannacc...
KDD
2004
ACM
173views Data Mining» more  KDD 2004»
16 years 4 months ago
A microeconomic data mining problem: customer-oriented catalog segmentation
The microeconomic framework for data mining [7] assumes that an enterprise chooses a decision maximizing the overall utility over all customers where the contribution of a custome...
Martin Ester, Rong Ge, Wen Jin, Zengjian Hu
TASE
2010
IEEE
14 years 10 months ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
135
Voted
SODA
2008
ACM
84views Algorithms» more  SODA 2008»
15 years 5 months ago
Robust cost colorings
We consider graph coloring problems where the cost of a coloring is the sum of the costs of the colors, and the cost of a color is a monotone concave function of the total weight ...
Takuro Fukunaga, Magnús M. Halldórss...
166
Voted
NIPS
1997
15 years 5 months ago
Learning to Order Things
There are many applications in which it is desirable to order rather than classify instances. Here we consider the problem of learning how to order, given feedback in the form of ...
William W. Cohen, Robert E. Schapire, Yoram Singer