Sciweavers

36887 search results - page 40 / 7378
» Are We All In the Same
Sort
View
IJCV
1998
192views more  IJCV 1998»
13 years 8 months ago
What Is the Set of Images of an Object Under All Possible Illumination Conditions?
The appearance of an object depends on both the viewpoint from which it is observed and the light sources by which it is illuminated. If the appearance of two objects is never iden...
Peter N. Belhumeur, David J. Kriegman
MST
2010
98views more  MST 2010»
13 years 7 months ago
Why Almost All k-Colorable Graphs Are Easy to Color
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
Amin Coja-Oghlan, Michael Krivelevich, Dan Vilench...
INFOCOM
2009
IEEE
14 years 3 months ago
All Bits Are Not Equal - A Study of IEEE 802.11 Communication Bit Errors
—In IEEE 802.11 Wireless LAN (WLAN) systems, techniques such as acknowledgement, retransmission, and transmission rate adaptation, are frame-level mechanisms designed for combati...
Bo Han, Lusheng Ji, Seungjoon Lee, Bishwaranjan Bh...
ORL
2008
86views more  ORL 2008»
13 years 9 months ago
A redundant Klee-Minty construction with all the redundant constraints touching the feasible region
By introducing some redundant Klee-Minty constructions, we have previously shown that the central path may visit every vertex of the Klee-Minty cube having 2n - 2 "sharp"...
Eissa Nematollahi, Tamás Terlaky
CANS
2009
Springer
165views Cryptology» more  CANS 2009»
14 years 3 months ago
Blink 'Em All: Scalable, User-Friendly and Secure Initialization of Wireless Sensor Nodes
Abstract. Wireless sensor networks have several useful applications in commercial and defense settings, as well as user-centric personal area networks. To establish secure (point-t...
Nitesh Saxena, Md. Borhan Uddin