Sciweavers

15485 search results - page 62 / 3097
» Computing Optimal Subsets
Sort
View
TAMC
2009
Springer
14 years 2 months ago
Approximation and Hardness Results for Label Cut and Related Problems
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
Peng Zhang, Jin-yi Cai, Linqing Tang, Wenbo Zhao
HYBRID
1999
Springer
13 years 12 months ago
Computing Controllers for Nonlinear Hybrid Systems
We discuss a procedure for synthesizing controllers for safety specifications for hybrid systems. The procedure depends on the construction of the set of states of a continuous dy...
Claire Tomlin, John Lygeros, Shankar Sastry
IDA
2005
Springer
14 years 1 months ago
Condensed Nearest Neighbor Data Domain Description
—A simple yet effective unsupervised classification rule to discriminate between normal and abnormal data is based on accepting test objects whose nearest neighbors’ distances ...
Fabrizio Angiulli
CIE
2005
Springer
14 years 1 months ago
Computability in Computational Geometry
We promote the concept of object directed computability in computational geometry in order to faithfully generalise the wellestablished theory of computability for real numbers and...
Abbas Edalat, Ali Asghar Khanban, André Lie...
ICML
2005
IEEE
14 years 8 months ago
Robust one-class clustering using hybrid global and local search
Unsupervised learning methods often involve summarizing the data using a small number of parameters. In certain domains, only a small subset of the available data is relevant for ...
Gunjan Gupta, Joydeep Ghosh