1489 search results - page 22 / 298 » Optimizing Feature Sets for Structured Data |
ICDM
2003
IEEE
15 years 2 months ago
2003
IEEE
Discovering underlying structure from co-occurrence data is an important task in a variety of fields, including: insurance, intelligence, criminal investigation, epidemiology, hu...
89
Voted
DIS
2010
Springer
14 years 7 months ago
2010
Springer
In this paper, we consider finding a small set of substring patterns which classifies the given documents well. We formulate the problem as 1 norm soft margin optimization problem ...
WADS
1997
Springer
15 years 1 months ago
1997
Springer
We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in R2 or R3. Our planar structures are actually fitted for a more ...
CIIT
2007
14 years 11 months ago
2007
Given a list of filtering rules with individual hitting probabilities, it is known that the average processing time of a linear-search based firewall can be minimized by searchi...
CC
2009
Springer
15 years 4 months ago
2009
Springer
Software systems typically exploit only a small fraction of the realizable performance from the underlying microprocessors. While there has been much work on hardware-aware optimiz...