Sciweavers

3192 search results - page 323 / 639
» The minimum latency problem
Sort
View
ICPR
2004
IEEE
16 years 6 months ago
Reconstructing a Dynamic Surface from Video Sequences Using Graph Cuts in 4D Space-Time
This paper is concerned with the problem of dynamically reconstructing the 3D surface of an object undergoing non-rigid motion. The problem is cast as reconstructing a continuous ...
Narendra Ahuja, Ning Xu, Tianli Yu
ICPR
2002
IEEE
16 years 6 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
ICCAD
2006
IEEE
104views Hardware» more  ICCAD 2006»
16 years 1 months ago
Fullwave volumetric Maxwell solver using conduction modes
We present a gridless method for solving the interior problem for a set of conductors in an homogeneous dielectric, at sufficiently high frequencies, valid for conductor lengths ...
Salvador Ortiz, Roberto Suaya
STACS
2010
Springer
15 years 12 months ago
Finding Induced Subgraphs via Minimal Triangulations
Potential maximal cliques and minimal separators are combinatorial objects which were introduced and studied in the realm of minimal triangulation problems including Minimum Fill-i...
Fedor V. Fomin, Yngve Villanger
DASFAA
2009
IEEE
129views Database» more  DASFAA 2009»
15 years 11 months ago
Towards Preference-Constrained k-Anonymisation
Abstract. In this paper, we propose a novel preference-constrained approach to k-anonymisation. In contrast to the existing works on kanonymisation which attempt to satisfy a minim...
Grigorios Loukides, Achilles Tziatzios, Jianhua Sh...