6110 search results - page 417 / 1222 » Approximate Computing |
205
Voted
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
161
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
The Metric Labeling problem is an elegant and powerful mathematical model capturing a wide range of classification problems. The input to the problem consists of a set of labels a...
205
click to vote
ISMIS
2000
Springer
15 years 10 months ago
2000
Springer
This paper introduces the design of rough neurons based on rough sets. Rough neurons instantiate approximate reasoning in assessing knowledge gleaned from input data. Each neuron c...
189
click to vote
DCOSS
2008
Springer
15 years 8 months ago
2008
Springer
Unlike traditional multihop forwarding among homogeneous static sensor nodes, use of mobile devices for data collection in wireless sensor networks has recently been gathering more...
218
click to vote
CG
2006
Springer
15 years 6 months ago
2006
Springer
s: clustering, denoising, sharp feature, shape abstraction, reverse engineering In this paper we describe a hierarchical face clustering algorithm for triangle meshes based on fit...