Sciweavers

168 search results - page 25 / 34
» Efficiently Detecting Inclusion Dependencies
Sort
View
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
14 years 5 months ago
Counting Stars and Other Small Subgraphs in Sublinear Time
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Mira Gonen, Dana Ron, Yuval Shavitt
CVPR
2009
IEEE
15 years 3 months ago
Automatic Reconstruction of Cities from Remote Sensor Data
In this paper, we address the complex problem of rapid modeling of large-scale areas and present a novel approach for the automatic reconstruction of cities from remote sensor da...
Charalambos Poullis (CGIT/IMSC/USC), Suya You (Uni...
ICIP
2007
IEEE
14 years 10 months ago
Mining Auxiliary Objects for Tracking by Multibody Grouping
On-line discovery of some auxiliary objects to verify the tracking results is a novel approach to achieving robust tracking by balancing the need for strong verification and compu...
Ming Yang, Ying Wu, Shihong Lao
ICIP
2002
IEEE
14 years 10 months ago
Dirty-paper trellis codes for watermarking
Informed coding is the practice of representing watermark messages with patterns that are dependent on the cover Works. This requires the use of a dirty-paper code, in which each ...
Gwenaël J. Doërr, Ingemar J. Cox, Matthe...
KDD
2003
ACM
156views Data Mining» more  KDD 2003»
14 years 8 months ago
Mining distance-based outliers in near linear time with randomization and a simple pruning rule
Defining outliers by their distance to neighboring examples is a popular approach to finding unusual examples in a data set. Recently, much work has been conducted with the goal o...
Stephen D. Bay, Mark Schwabacher