Sciweavers

7129 search results - page 674 / 1426
» Approximation Algorithms for Treewidth
Sort
View

Book
376views
17 years 4 months ago
An Exploration of Random Processes for Engineers
"From an applications viewpoint, the main reason to study the subject of these notes is to help deal with the complexity of describing random, time-varying functions. A random...
Bruce Hajek
ECCV
2004
Springer
16 years 9 months ago
A Statistical Model for General Contextual Object Recognition
We consider object recognition as the process of attaching meaningful labels to specific regions of an image, and propose a model that learns spatial relationships between objects....
Peter Carbonetto, Nando de Freitas, Kobus Barnard
186
Voted
KDD
2007
ACM
168views Data Mining» more  KDD 2007»
16 years 7 months ago
Detecting time series motifs under uniform scaling
Time series motifs are approximately repeated patterns found within the data. Such motifs have utility for many data mining algorithms, including rule-discovery, novelty-detection...
Dragomir Yankov, Eamonn J. Keogh, Jose Medina, Bil...
SIGMOD
2004
ACM
150views Database» more  SIGMOD 2004»
16 years 7 months ago
When one Sample is not Enough: Improving Text Database Selection Using Shrinkage
Database selection is an important step when searching over large numbers of distributed text databases. The database selection task relies on statistical summaries of the databas...
Panagiotis G. Ipeirotis, Luis Gravano
PERCOM
2006
ACM
16 years 7 months ago
Strong Edge Coloring for Channel Assignment in Wireless Radio Networks
Abstract-- We give efficient sequential and distributed approximation algorithms for strong edge coloring graphs modeling wireless networks. Strong edge coloring is equivalent to c...
Christopher L. Barrett, V. S. Anil Kumar, Madhav V...