3008 search results - page 362 / 602 » Independence in connected graphs |
182
click to vote
PPDP
2009
Springer
16 years 1 months ago
2009
Springer
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...
189
click to vote
ICWE
2007
Springer
16 years 1 months ago
2007
Springer
In recent years, innovation in technologies such as web services, business process automation, etc., have motivated a new paradigm in the application development field to appear, k...
173
click to vote
FOCS
2006
IEEE
16 years 27 days ago
2006
IEEE
Lossless condensers are unbalanced expander graphs, with expansion close to optimal. Equivalently, they may be viewed as functions that use a short random seed to map a source on ...
169
click to vote
ICS
1989
Tsinghua U.
15 years 11 months ago
1989
Tsinghua U.
Control intensive scalar programs pose a very different challenge to highly pipelined supercomputers than vectorizable numeric applications. Function call/return and branch instru...
154
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
We introduce a multi-stage ensemble framework, ErrorDriven Generalist+Expert or Edge, for improved classification on large-scale text categorization problems. Edge first trains a ...