Sciweavers

7129 search results - page 353 / 1426
» Approximation Algorithms for Treewidth
Sort
View
WABI
2010
Springer
124views Bioinformatics» more  WABI 2010»
15 years 3 months ago
Improved Orientations of Physical Networks
Abstract. The orientation of physical networks is a prime task in deciphering the signaling-regulatory circuitry of the cell. One manifestation of this computational task is as a m...
Iftah Gamzu, Danny Segev, Roded Sharan
COMPGEOM
2007
ACM
15 years 8 months ago
Bi-criteria linear-time approximations for generalized k-mean/median/center
We consider the problem of approximating a set P of n points in Rd by a collection of j-dimensional flats, and extensions thereof, under the standard median / mean / center measur...
Dan Feldman, Amos Fiat, Micha Sharir, Danny Segev
ECAI
2006
Springer
15 years 8 months ago
An Efficient Upper Approximation for Conditional Preference
The fundamental operation of dominance testing, i.e., determining if one alternative is preferred to another, is in general very hard for methods of reasoning with qualitative cond...
Nic Wilson
AAAI
2007
15 years 7 months ago
Partial Matchmaking using Approximate Subsumption
Description Logics, and in particular the web ontology language OWL has been proposed as an appropriate basis for computing matches between structured objects for the sake of info...
Heiner Stuckenschmidt
AUTOMATICA
2006
111views more  AUTOMATICA 2006»
15 years 4 months ago
The minimal disturbance invariant set: Outer approximations via its partial sums
This paper is concerned with outer approximations of the minimal disturbance invariant set (MDIS) of a discrete-time linear system with an additive set-bounded disturbance. The k-...
Chong Jin Ong, Elmer G. Gilbert