Sciweavers

489 search results - page 72 / 98
» Approximation Algorithms for the Minimum-Length Corridor and...
Sort
View
KDD
2005
ACM
80views Data Mining» more  KDD 2005»
14 years 8 months ago
Wavelet synopsis for data streams: minimizing non-euclidean error
We consider the wavelet synopsis construction problem for data streams where given n numbers we wish to estimate the data by constructing a synopsis, whose size, say B is much sma...
Sudipto Guha, Boulos Harb
PODS
2007
ACM
159views Database» more  PODS 2007»
14 years 7 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
ECCV
2004
Springer
14 years 9 months ago
Multiple View Feature Descriptors from Image Sequences via Kernel Principal Component Analysis
Abstract. We present a method for learning feature descriptors using multiple images, motivated by the problems of mobile robot navigation and localization. The technique uses the ...
Jason Meltzer, Ming-Hsuan Yang, Rakesh Gupta, Stef...
IRI
2006
IEEE
14 years 1 months ago
Replacing full rectangles by dense rectangles: Concept lattices and attribute implications
— Maximal full rectangles in tabular data are useful in several areas of data engineering. This paper presents a survey of results in which we replace “full rectangles” by ...
Radim Belohlávek, Vilém Vychodil
ICSM
2003
IEEE
14 years 27 days ago
Reverse Engineering of the Interaction Diagrams from C++ Code
In object oriented programming, the functionalities of a system result from the interactions (message exchanges) among the objects allocated by the system. While designing object ...
Paolo Tonella, Alessandra Potrich