9842 search results - page 1843 / 1969 » The Complexity of the Matching-Cut Problem |
126
Voted
BIRTHDAY
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. A novel framework for the design and analysis of energy-aware algorithms is presented, centered around a deterministic Bit-level (Boltzmann) Random Access Machine or BRAM...
137
Voted
CHARME
2003
Springer
15 years 9 months ago
2003
Springer
We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constra...
155
Voted
CIVR
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. The paper describes a fast system for appearance based image recognition . It uses local invariant descriptors and efficient nearest neighbor search. First, local affine ...
124
Voted
COCO
2003
Springer
15 years 8 months ago
2003
Springer
We study the complexity of building pseudorandom generators (PRGs) with logarithmic seed length from hard functions. We show that, starting from a function f : {0, 1}l → {0, 1} ...
157
Voted
COLT
2003
Springer
15 years 8 months ago
2003
Springer
The application of statistical methods to natural language processing has been remarkably successful over the past two decades. But, to deal with recent problems arising in this ï¬...