Sciweavers

10414 search results - page 178 / 2083
» An efficient algorithm for Co-segmentation
Sort
View
SIS
2004
15 years 7 months ago
Efficient Tree Search in Encrypted Data
Abstract. Sometimes there is a need to store sensitive data on an untrusted database server. Song, Wagner and Perrig have introduced a way to search for the existence of a word in ...
Richard Brinkman, Ling Feng, Jeroen Doumen, Pieter...
RP
2010
Springer
118views Control Systems» more  RP 2010»
15 years 4 months ago
Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA
Chrobak (1986) proved that a language accepted by a given nondeterministic finite automaton with one-letter alphabet, i.e., a unary NFA, with n states can be represented as the uni...
Zdenek Sawa
ISPD
1999
ACM
83views Hardware» more  ISPD 1999»
15 years 10 months ago
Efficient solution of systems of orientation constraints
One subtask in constraint-driven placement is enforcing a set of orientation constraints on the devices being placed. Such constraints are created in order to, for example, implem...
Joseph L. Ganley
VLDB
1998
ACM
77views Database» more  VLDB 1998»
15 years 10 months ago
Safely and Efficiently Updating References During On-line Reorganization
With today's demands for continuous availability of mission-critical databases, on-line reorganization is a necessity. In this paper we present a new on-Iine reorganization a...
Chendong Zou, Betty Salzberg
WSCG
2001
98views more  WSCG 2001»
15 years 7 months ago
Geometric Simplification for Efficient Occlusion Culling in Urban Scenes
Most occlusion culling algorithms select a subset of suitable occluder planes or geometries to exclude invisible objects from further visualization processing. Preferably these oc...
Rick Germs, Frederik W. Jansen