Sciweavers

7150 search results - page 1336 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
VISUALIZATION
1997
IEEE
15 years 4 months ago
Simplifying polygonal models using successive mappings
: We present the use of mapping functions to automatically generate levels of detail with known error bounds for polygonal models. We develop a piece-wise linear mapping function f...
Jonathan D. Cohen, Dinesh Manocha, Marc Olano
WDAG
1990
Springer
80views Algorithms» more  WDAG 1990»
15 years 4 months ago
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
Ofer Biran, Shlomo Moran, Shmuel Zaks
124
Voted
DAS
2010
Springer
15 years 4 months ago
Nearest neighbor based collection OCR
Conventional optical character recognition (OCR) systems operate on individual characters and words, and do not normally exploit document or collection context. We describe a Coll...
K. Pramod Sankar, C. V. Jawahar, Raghavan Manmatha
DAC
2010
ACM
15 years 4 months ago
LUT-based FPGA technology mapping for reliability
As device size shrinks to the nanometer range, FPGAs are increasingly prone to manufacturing defects. We anticipate that the ability to tolerate multiple defects will be very impo...
Jason Cong, Kirill Minkovich
108
Voted
CIKM
2006
Springer
15 years 4 months ago
Mining compressed commodity workflows from massive RFID data sets
Radio Frequency Identification (RFID) technology is fast becoming a prevalent tool in tracking commodities in supply chain management applications. The movement of commodities thr...
Hector Gonzalez, Jiawei Han, Xiaolei Li
« Prev « First page 1336 / 1430 Last » Next »