Sciweavers

1489 search results - page 22 / 298
» Optimizing Feature Sets for Structured Data
Sort
View
ICDM
2003
IEEE
100views Data Mining» more  ICDM 2003»
14 years 26 days ago
Tractable Group Detection on Large Link Data Sets
Discovering underlying structure from co-occurrence data is an important task in a variety of fields, including: insurance, intelligence, criminal investigation, epidemiology, hu...
Jeremy Kubica, Andrew W. Moore, Jeff G. Schneider
DIS
2010
Springer
13 years 5 months ago
Sparse Substring Pattern Set Discovery Using Linear Programming Boosting
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 ...
Kazuaki Kashihara, Kohei Hatano, Hideo Bannai, Mas...
WADS
1997
Springer
108views Algorithms» more  WADS 1997»
13 years 11 months ago
Dynamic Data Structures for Fat Objects and Their Applications
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 ...
Alon Efrat, Matthew J. Katz, Frank Nielsen, Micha ...
CIIT
2007
133views Communications» more  CIIT 2007»
13 years 9 months ago
Linear-tree rule structure for firewall optimization
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...
Liang Zhao, A. Shimae, Hiroshi Nagamochi
CC
2009
Springer
106views System Software» more  CC 2009»
14 years 2 months ago
Blind Optimization for Exploiting Hardware Features
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...
Dan Knights, Todd Mytkowicz, Peter F. Sweeney, Mic...