Sciweavers

490 search results - page 23 / 98
» Impossibilities for roommate problems
Sort
View
ICPR
2002
IEEE
14 years 8 months ago
A New Algorithm for Inexact Graph Matching
The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph matching. Inexact g...
Adel Hlaoui, Shengrui Wang
DOLAP
2009
ACM
14 years 2 months ago
View usability and safety for the answering of top-k queries via materialized views
In this paper, we investigate the problem of answering top-k queries via materialized views. We provide theoretical guarantees for the adequacy of a view to answer a top-k query, ...
Eftychia Baikousi, Panos Vassiliadis
3DPVT
2006
IEEE
240views Visualization» more  3DPVT 2006»
14 years 1 months ago
Global Depth from Epipolar Volumes--A General Framework for Reconstructing Non-Lambertian Surfaces
Using Epipolar Image Analysis in the context of the correspondence finding problem in depth reconstruction has several advantages. One is the elegant incorporation of prior knowl...
Timo Stich, Art Tevs, Marcus A. Magnor
ADMA
2006
Springer
112views Data Mining» more  ADMA 2006»
14 years 1 months ago
Finding Time Series Discords Based on Haar Transform
The problem of finding anomaly has received much attention recently. However, most of the anomaly detection algorithms depend on an explicit definition of anomaly, which may be i...
Ada Wai-Chee Fu, Oscar Tat-Wing Leung, Eamonn J. K...
SAC
2006
ACM
14 years 1 months ago
Quiescent consensus in mobile ad-hoc networks using eventually storage-free broadcasts
We solve the consensus problem using a new class of broadcasts that are very appropriate to ad-hoc networking: every broadcast message is eventually ensured to be garbagecollected...
François Bonnet, Paul D. Ezhilchelvan, Eina...