Sciweavers

1964 search results - page 270 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
113
Voted
STOC
2006
ACM
170views Algorithms» more  STOC 2006»
16 years 2 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
115
Voted
TWC
2008
155views more  TWC 2008»
15 years 2 months ago
Distributed sensor network localization using SOCP relaxation
The goal of the sensor network localization problem is to determine positions of all sensor nodes in a network given certain pairwise noisy distance measurements and some anchor no...
Seshan Srirangarajan, Ahmed H. Tewfik, Zhi-Quan Lu...
206
Voted
SIGMOD
2008
ACM
158views Database» more  SIGMOD 2008»
16 years 2 months ago
Sampling cube: a framework for statistical olap over sampling data
Sampling is a popular method of data collection when it is impossible or too costly to reach the entire population. For example, television show ratings in the United States are g...
Xiaolei Li, Jiawei Han, Zhijun Yin, Jae-Gil Lee, Y...
ASUNAM
2009
IEEE
15 years 7 months ago
Filtering Spam in Social Tagging System with Dynamic Behavior Analysis
—Spam in social tagging systems introduced by some malicious participants has become a serious problem for its global popularizing. Some studies which can be deduced to static us...
Bo Liu, Ennan Zhai, Huiping Sun, Yelu Chen, Zhong ...
121
Voted
CISSE
2008
Springer
15 years 4 months ago
From Constraints to Resolution Rules Part I : conceptual framework
: Many real world problems appear naturally as constraints satisfaction problems (CSP), for which very efficient algorithms are known. Most of these involve the combination of two ...
Denis Berthier