Sciweavers

16404 search results - page 517 / 3281
» A set coverage problem
Sort
View
AMAI
2010
Springer
15 years 4 months ago
Interval-valued soft constraint problems
Constraints and quantitative preferences, or costs, are very useful for modelling many real-life problems. However, in many settings, it is difficult to specify precise preference ...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
JCST
2010
109views more  JCST 2010»
15 years 1 months ago
The Inverse Classification Problem
In this paper, we examine an emerging variation of the classification problem, which is known as the inverse classification problem. In this problem, we determine the features to b...
Charu C. Aggarwal, Chen Chen, Jiawei Han
STOC
2003
ACM
141views Algorithms» more  STOC 2003»
16 years 7 months ago
Better streaming algorithms for clustering problems
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
Moses Charikar, Liadan O'Callaghan, Rina Panigrahy
ICSE
2008
IEEE-ACM
16 years 7 months ago
3rd international workshop on advances and applications of problem frames
Central to the problem frames approach is the distinction of three different descriptions: requirements R, domain assumptions W and specifications S, tied together with the socall...
Thein Than Tun, Jon G. Hall, Lucia Rapanotti, Karl...
PLDI
2010
ACM
16 years 4 months ago
The Reachability-Bound Problem
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
Sumit Gulwani, Florian Zuleger