Sciweavers

EDBT
2009
ACM
108views Database» more  EDBT 2009»
13 years 9 months ago
Reverse k-nearest neighbor search in dynamic and general metric databases
In this paper, we propose an original solution for the general reverse k-nearest neighbor (RkNN) search problem. Compared to the limitations of existing methods for the RkNN searc...
Elke Achtert, Hans-Peter Kriegel, Peer Kröger...
CDC
2009
IEEE
127views Control Systems» more  CDC 2009»
13 years 9 months ago
Dirichlet problems for some Hamilton-Jacobi equations with inequality constraints
We use viability techniques for solving Dirichlet problems with inequality constraints (obstacles) for a class of Hamilton-Jacobi equations. The hypograph of the “solution” is ...
Jean-Pierre Aubin, Alexandre M. Bayen, Patrick Sai...
KR
2010
Springer
13 years 9 months ago
Finding the Next Solution in Constraint- and Preference-Based Knowledge Representation Formalisms
In constraint or preference reasoning, a typical task is to compute a solution, or an optimal solution. However, when one has already a solution, it may be important to produce th...
Ronen I. Brafman, Francesca Rossi, Domenico Salvag...
CPAIOR
2010
Springer
13 years 9 months ago
Constraint Reasoning with Uncertain Data Using CDF-Intervals
Interval coefficients have been introduced in OR and CP to specify uncertain data in order to provide reliable solutions to convex models. The output is generally a solution set, ...
Aya Saad, Carmen Gervet, Slim Abdennadher
ICPR
2002
IEEE
13 years 9 months ago
Near-Optimal Regularization Parameters for Applications in Computer Vision
Computer vision requires the solution of many ill-posed problems such as optical flow, structure from motion, shape from shading, surface reconstruction, image restoration and ed...
Changjiang Yang, Ramani Duraiswami, Larry S. Davis
ESA
2003
Springer
124views Algorithms» more  ESA 2003»
13 years 10 months ago
The Minimum Generalized Vertex Cover Problem
Let G = (V, E) be an undirected graph, with three numbers d0(e) ≥ d1(e) ≥ d2(e) ≥ 0 for each edge e ∈ E. A solution is a subset U ⊆ V and di(e) represents the cost contr...
Refael Hassin, Asaf Levin
EMO
2003
Springer
137views Optimization» more  EMO 2003»
13 years 10 months ago
A Two-Phase Local Search for the Biobjective Traveling Salesman Problem
This article proposes the Two-Phase Local Search for finding a good approximate set of non-dominated solutions. The two phases of this procedure are to (i) generate an initial sol...
Luis Paquete, Thomas Stützle
HICSS
2003
IEEE
147views Biometrics» more  HICSS 2003»
13 years 10 months ago
Balancing Energy Saving and QoS in the Mobile Internet: An Application-Independent Approach
The scarcity of energetic resources in mobile computers is a very limiting factor. In this paper we propose a solution that tries to balance energy consumption and QoS requirement...
Giuseppe Anastasi, Marco Conti, Enrico Gregori, An...
ECBS
2003
IEEE
133views Hardware» more  ECBS 2003»
13 years 10 months ago
Enterprise-Wide Solutions Architecting Using UML
- In concert with customer and marketing staffs, systems engineers often formulate and codify an initial overall software system solution to fulfill customer needs. Without a focus...
Diane Feldman, Josephine Micallef, Dennis Mulcare
DATE
2003
IEEE
81views Hardware» more  DATE 2003»
13 years 10 months ago
Equisolvability of Series vs. Controller's Topology in Synchronous Language Equations
Given a plant Å and a specification Å , the largest solution of the FSM equation Å ¯ Å Å contains all possible discrete controllers Å . Often we are interested in computin...
Nina Yevtushenko, Tiziano Villa, Robert K. Brayton...