Sciweavers

10051 search results - page 40 / 2011
» A Dynamic Separator Algorithm
Sort
View
PODC
2006
ACM
15 years 6 months ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah
ICANN
2009
Springer
15 years 5 months ago
Constrained Learning Vector Quantization or Relaxed k-Separability
Neural networks and other sophisticated machine learning algorithms frequently miss simple solutions that can be discovered by a more constrained learning methods. Transition from ...
Marek Grochowski, Wlodzislaw Duch
88
Voted
SIAMCOMP
2008
78views more  SIAMCOMP 2008»
15 years 12 days ago
I/O-Efficient Planar Separators
We present a new algorithm to compute a subset S of vertices of a planar graph G whose removal partitions G into O(N/h) subgraphs of size O(h) and with boundary size O( h) each. ...
Anil Maheshwari, Norbert Zeh
104
Voted
JMM2
2007
100views more  JMM2 2007»
15 years 11 days ago
On Separation of English Numerals from Multilingual Document Images
— For Optical Character Recognition (OCR) of bilingual or multilingual document containing text words in regional language and numerals in English, it is necessary to identify di...
Basanna V. Dhandra, Mallikarjun Hangarge
DLS
2005
176views Languages» more  DLS 2005»
15 years 2 months ago
Dynamic data polyvariance using source-tagged classes
The DDP (Demand-driven/Pruning) analysis algorithm allows us to perform data-flow analyses of programming languages that are dynamically typed and have higher-order control flow...
S. Alexander Spoon, Olin Shivers