Sciweavers

1850 search results - page 315 / 370
» Design-for-debugging of application specific designs
Sort
View
KDD
2004
ACM
209views Data Mining» more  KDD 2004»
14 years 9 months ago
A data mining approach to modeling relationships among categories in image collection
This paper proposes a data mining approach to modeling relationships among categories in image collection. In our approach, with image feature grouping, a visual dictionary is cre...
Ruofei Zhang, Zhongfei (Mark) Zhang, Sandeep Khanz...
KDD
2002
ACM
147views Data Mining» more  KDD 2002»
14 years 9 months ago
The Impact of Site Structure and User Environment on Session Reconstruction in Web Usage Analysis
The analysis of user behavior on the Web presupposes a reliable reconstruction of the users' navigational activities. Cookies and server-generated session identifiers have be...
Bettina Berendt, Bamshad Mobasher, Miki Nakagawa, ...
STOC
2006
ACM
170views Algorithms» more  STOC 2006»
14 years 9 months ago
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
Vitaly Feldman
STOC
2004
ACM
107views Algorithms» more  STOC 2004»
14 years 9 months ago
Primal-dual algorithms for deterministic inventory problems
We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. ...
Retsef Levi, Robin Roundy, David B. Shmoys
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
14 years 9 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi