Sciweavers

6455 search results - page 253 / 1291
» Research problems
Sort
View
JPDC
2006
148views more  JPDC 2006»
15 years 6 months ago
Efficient algorithm for placing a given number of base stations to cover a convex region
In the context of mobile communication, an efficient algorithm for the base-station placement problem is developed in this paper. The objective is to place a given number of base-...
Gautam K. Das, Sandip Das, Subhas C. Nandy, Bhaban...
ACSAC
2005
IEEE
16 years 6 days ago
Graphical Passwords: A Survey
The most common computer authentication method is to use alphanumerical usernames and passwords. This method has been shown to have significant drawbacks. For example, users tend ...
Xiaoyuan Suo, Ying Zhu, G. Scott Owen
VIS
2004
IEEE
116views Visualization» more  VIS 2004»
16 years 7 months ago
Immersive Design of DNA Molecules with a Tangible Interface
This paper presents an experimental immersive interface for designing DNAcomponents for application in nanotechnology. While much research has been done on immersive visualization...
Hiroshi Ishii, Peter Schröder, Steven Schkoln...
DAC
2001
ACM
16 years 7 months ago
Watermarking of SAT using Combinatorial Isolation Lemmas
Watermarking of hardware and software designs is an effective mechanism for intellectual property protection (IPP). Two important criteria for watermarking schemes are credibility...
Rupak Majumdar, Jennifer L. Wong
STOC
2003
ACM
122views Algorithms» more  STOC 2003»
16 years 6 months ago
Learning juntas
We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean function which depends on an unknown set of k out of n Boolean variables. We give...
Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio