2434 search results - page 402 / 487 » Algorithmic Randomness of Closed Sets |
161
click to vote
TJS
2002
15 years 2 months ago
2002
Historically, compilers have operated by applying a fixed set of optimizations in a predetermined order. We call such an ordered list of optimizations a compilation sequence. This...
170
Voted
ECCV
2004
Springer
16 years 5 months ago
2004
Springer
The problem of interactive foreground/background segmentation in still images is of great practical importance in image editing. The state of the art in interactive segmentation is...
140
Voted
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
254
click to vote
VLDB
2007
ACM
16 years 3 months ago
2007
ACM
Whenever an intrusion occurs, the security and value of a computer system is compromised. Network-based attacks make it difficult for legitimate users to access various network ser...
157
click to vote
JBI
2004
15 years 4 months ago
2004
Microarray analysis using clustering algorithms can suffer from lack of inter-method consistency in assigning related gene-expression profiles to clusters. Obtaining a consensus s...