2168 search results - page 116 / 434 » Randomized Algorithms and Complexity Theory |
182
click to vote
COLOGNETWENTE
2010
15 years 1 months ago
2010
Bisimplicial edges in bipartite graphs are closely related to pivots in Gaussian elimination that avoid turning zeroes into non-zeroes. We present a new deterministic algorithm to...
150
click to vote
CSCLP
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
140
click to vote
CAE
2007
15 years 5 months ago
2007
In 1928, George D. Birkhoff introduced the Aesthetic Measure, defined as the ratio between order and complexity, and, in 1965, Max Bense analyzed Birkhoff's measure from an i...
160
click to vote
KDD
2010
ACM
15 years 7 months ago
2010
ACM
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
134
click to vote
TPHOL
2005
IEEE
15 years 8 months ago
2005
IEEE
We describe a formalization of the elementary algebra, topology and analysis of finite-dimensional Euclidean space in the HOL Light theorem prover. (Euclidean space is RN with the...