Sciweavers

2413 search results - page 154 / 483
» Understanding the problem
Sort
View
IPL
2008
89views more  IPL 2008»
15 years 4 months ago
On the tractability of coloring semirandom graphs
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
Julia Böttcher, Dan Vilenchik
ICDE
2003
IEEE
160views Database» more  ICDE 2003»
16 years 6 months ago
HD-Eye - Visual Clustering of High dimensional Data
Clustering of large data bases is an important research area with a large variety of applications in the data base context. Missing in most of the research efforts are means for g...
Alexander Hinneburg, Daniel A. Keim, Markus Wawryn...
142
Voted
ESAW
2000
Springer
15 years 8 months ago
Engineering Social Order
Social Order becomes a major problem in MAS and in computer mediated human interaction. After explaining the notions of Social Order and Social Control, I claim that there are mult...
Cristiano Castelfranchi
CTW
2002
91views more  CTW 2002»
15 years 4 months ago
Can We Ever Escape from Data Overload? A Cognitive Systems Diagnosis
ive. This characterization leads to model-based abstractions and representation design techniques as potential solutions. Many of the existing approaches to coping with data overlo...
David D. Woods, Emily S. Patterson, Emilie M. Roth
SDM
2009
SIAM
164views Data Mining» more  SDM 2009»
16 years 2 months ago
Time-Decayed Correlated Aggregates over Data Streams.
Data stream analysis frequently relies on identifying correlations and posing conditional queries on the data after it has been seen. Correlated aggregates form an important examp...
Graham Cormode, Srikanta Tirthapura, Bojian Xu