Sciweavers

3897 search results - page 511 / 780
» complexity 2010
Sort
View
FASE
2010
Springer
15 years 10 months ago
Incremental Service Composition Based on Partial Matching of Visual Contracts
Services provide access to software components that can be discovered dynamically via the Internet. The increasing number of services a requesters may be able to use demand support...
Muhammad Naeem, Reiko Heckel, Fernando Orejas, Fra...
FC
2010
Springer
226views Cryptology» more  FC 2010»
15 years 10 months ago
Shoulder-Surfing Safe Login in a Partially Observable Attacker Model
Abstract. Secure login methods based on human cognitive skills can be classified into two categories based on information available to a passive attacker: (i) the attacker fully ob...
Toni Perkovic, Mario Cagalj, Nitesh Saxena
FUN
2010
Springer
230views Algorithms» more  FUN 2010»
15 years 10 months ago
O(1)-Time Unsorting by Prefix-Reversals in a Boustrophedon Linked List
Conventional wisdom suggests that O(k)-time is required to reverse a substring of length k. To reduce this time complexity, a simple and unorthodox data structure is introduced. A ...
Aaron Williams
CVPR
2010
IEEE
15 years 10 months ago
Bundled Depth-Map Merging for Multi-View Stereo
Depth-map merging is one typical technique category for multi-view stereo (MVS) reconstruction. To guarantee accuracy, existing algorithms usually require either sub-pixel level s...
Jianguo Li
POPL
2010
ACM
15 years 9 months ago
Reconfigurable asynchronous logic automata: (RALA)
Computer science has served to insulate programs and programmers from knowledge of the underlying mechanisms used to manipulate information, however this fiction is increasingly h...
Neil Gershenfeld, David Dalrymple, Kailiang Chen, ...