Sciweavers

1404 search results - page 264 / 281
» Optimization problems in multiple-interval graphs
Sort
View
FORMATS
2008
Springer
13 years 11 months ago
Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets
Abstract. We introduce and study hybrid automata with strong resets. They generalize o-minimal hybrid automata, a class of hybrid automata which allows modeling of complex continuo...
Patricia Bouyer, Thomas Brihaye, Marcin Jurdzinski...
NIPS
2008
13 years 11 months ago
Inferring rankings under constrained sensing
Motivated by applications like elections, web-page ranking, revenue maximization etc., we consider the question of inferring popular rankings using constrained data. More specific...
Srikanth Jagabathula, Devavrat Shah
LWA
2007
13 years 11 months ago
Multi-objective Frequent Termset Clustering
Large, high dimensional data spaces, are still a challenge for current data clustering methods. Frequent Termset (FTS) clustering is a technique developed to cope with these chall...
Andreas Kaspari, Michael Wurst
SDM
2008
SIAM
176views Data Mining» more  SDM 2008»
13 years 11 months ago
A General Model for Multiple View Unsupervised Learning
Multiple view data, which have multiple representations from different feature spaces or graph spaces, arise in various data mining applications such as information retrieval, bio...
Bo Long, Philip S. Yu, Zhongfei (Mark) Zhang
SODA
2004
ACM
144views Algorithms» more  SODA 2004»
13 years 11 months ago
Covering minimum spanning trees of random subgraphs
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
Michel X. Goemans, Jan Vondrák