Sciweavers

376 search results - page 27 / 76
» On the Advice Complexity of Online Problems
Sort
View
DFT
2006
IEEE
120views VLSI» more  DFT 2006»
15 years 5 months ago
On-Line Mapping of In-Field Defects in Image Sensor Arrays
Continued increase in complexity of digital image sensors means that defects are more likely to develop in the field, but little concrete information is available on in-field defe...
Jozsef Dudas, Cory Jung, Linda Wu, Glenn H. Chapma...
99
Voted
INFOCOM
2010
IEEE
14 years 10 months ago
SlideOR: Online Opportunistic Network Coding in Wireless Mesh Networks
—Opportunistic routing significantly increases unicast throughput in wireless mesh networks by effectively utilizing the wireless broadcast medium. With network coding, opportun...
Yunfeng Lin, Ben Liang, Baochun Li
HEURISTICS
2000
127views more  HEURISTICS 2000»
14 years 11 months ago
Fast, Efficient Equipment Placement Heuristics for Broadband Switched or Internet Router Networks
Planning and designing the next generation of IP router or switched broadband networks seems a daunting challenge considering the many complex, interacting factors affecting the p...
Joel W. Gannett
KDD
2006
ACM
155views Data Mining» more  KDD 2006»
16 years 4 days ago
Camouflaged fraud detection in domains with complex relationships
We describe a data mining system to detect frauds that are camouflaged to look like normal activities in domains with high number of known relationships. Examples include accounti...
Sankar Virdhagriswaran, Gordon Dakin
ICRA
2007
IEEE
134views Robotics» more  ICRA 2007»
15 years 6 months ago
MRBUG: A Competitive Multi-Robot Path Finding Algorithm
— We explore an on-line problem where a group of robots has to reach a target whose position is known in an unknown planar environment whose geometry is acquired by the robots du...
Shahar Sarid, Amir Shapiro, Yoav Gabriely