Sciweavers

260 search results - page 19 / 52
» Hardness of Parameterized Resolution
Sort
View
ICTAI
2003
IEEE
14 years 29 days ago
Approximate Discrete Probability Distribution Representation Using a Multi-Resolution Binary Tree
Computing and storing probabilities is a hard problem as soon as one has to deal with complex distributions over multiples random variables. The problem of efficient representati...
David Bellot, Pierre Bessière
SGP
2007
13 years 10 months ago
Shape optimization using reflection lines
Many common objects have highly reflective metallic or painted finishes. Their appearance is primarily defined by the distortion the curved shape of the surface introduces in the ...
E. Tosun, Yotam I. Gingold, Jason Reisman, Denis Z...
ICDM
2010
IEEE
125views Data Mining» more  ICDM 2010»
13 years 5 months ago
Evolving Ensemble-Clustering to a Feedback-Driven Process
Abstract--Data clustering is a highly used knowledge extraction technique and is applied in more and more application domains. Over the last years, a lot of algorithms have been pr...
Martin Hahmann, Dirk Habich, Wolfgang Lehner
DIALM
2004
ACM
161views Algorithms» more  DIALM 2004»
13 years 11 months ago
Batch conflict resolution algorithm with progressively accurate multiplicity estimation
The wireless connectivity, essential for pervasive computing, has ephemeral character and can be used for creating ad hoc networks, sensor networks, connection with RFID tags etc....
Petar Popovski, Frank H. P. Fitzek, Ramjee Prasad
KDD
2008
ACM
142views Data Mining» more  KDD 2008»
14 years 8 months ago
Efficient ticket routing by resolution sequence mining
IT problem management calls for quick identification of resolvers to reported problems. The efficiency of this process highly depends on ticket routing--transferring problem ticke...
Qihong Shao, Yi Chen, Shu Tao, Xifeng Yan, Nikos A...