Sciweavers

398 search results - page 54 / 80
» A new biclustering technique based on crossing minimization
Sort
View
90
Voted
IJCV
2006
116views more  IJCV 2006»
15 years 11 days ago
Structure-Texture Image Decomposition - Modeling, Algorithms, and Parameter Selection
This paper explores various aspects of the image decomposition problem using modern variational techniques. We aim at splitting an original image f into two components u and v, whe...
Jean-François Aujol, Guy Gilboa, Tony F. Ch...
SIAMJO
2002
122views more  SIAMJO 2002»
15 years 1 days ago
Robust Filtering via Semidefinite Programming with Applications to Target Tracking
In this paper we propose a novel finite-horizon, discrete-time, time-varying filtering method based on the robust semidefinite programming (SDP) technique. The proposed method prov...
Lingjie Li, Zhi-Quan Luo, Timothy N. Davidson, Kon...
193
Voted
ICDE
2001
IEEE
141views Database» more  ICDE 2001»
16 years 1 months ago
Processing Queries with Expensive Functions and Large Objects in Distributed Mediator Systems
LeSelect is a mediator system which allows scientists to publish their resources (data and programs) so they can be transparently accessed. The scientists can typically issue quer...
Fabio Porto, Françoise Fabret, Luc Bouganim...
81
Voted
CHI
2009
ACM
16 years 29 days ago
DynaSpot: speed-dependent area cursor
We present DynaSpot, a new technique for acquiring targets based on the area cursor. DynaSpot couples the cursor's activation area with its speed, behaving like a point curso...
Olivier Chapuis, Jean-Baptiste Labrune, Emmanuel P...
ESOP
2007
Springer
15 years 6 months ago
Static Analysis by Policy Iteration on Relational Domains
We give a new practical algorithm to compute, in finite time, a fixpoint (and often the least fixpoint) of a system of equations in the abstract numerical domains of zones and t...
Stephane Gaubert, Eric Goubault, Ankur Taly, Sarah...