Sciweavers

16844 search results - page 3086 / 3369
» How to Design Programs
Sort
View
STACS
2007
Springer
16 years 23 days ago
Wavelength Management in WDM Rings to Maximize the Number of Connections
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
Ioannis Caragiannis
AUIC
2006
IEEE
16 years 22 days ago
Implementing a natural user interface for camera phones using visual tags
Pointing is a natural way of communicating. Children in all cultures use pointing inherently. Attaching tags to our environment enables interaction by pointing. Visual tags are a g...
Sanni Siltanen, Jouko Hyväkkä
CCGRID
2006
IEEE
16 years 22 days ago
Proposal of MPI Operation Level Checkpoint/Rollback and One Implementation
With the increasing number of processors in modern HPC(High Performance Computing) systems, there are two emergent problems to solve. One is scalability, the other is fault tolera...
Yuan Tang, Graham E. Fagg, Jack Dongarra
FOCS
2006
IEEE
16 years 21 days ago
Hardness of Learning Halfspaces with Noise
Learning an unknown halfspace (also called a perceptron) from labeled examples is one of the classic problems in machine learning. In the noise-free case, when a halfspace consist...
Venkatesan Guruswami, Prasad Raghavendra
FOCS
2006
IEEE
16 years 21 days ago
Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
Uriel Feige, Jan Vondrák
« Prev « First page 3086 / 3369 Last » Next »