Sciweavers

4110 search results - page 596 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
WWW
2008
ACM
16 years 7 months ago
Race: finding and ranking compact connected trees for keyword proximity search over xml documents
In this paper, we study the problem of keyword proximity search over XML documents and leverage the efficiency and effectiveness. We take the disjunctive semantics among input key...
Guoliang Li, Jianhua Feng, Jianyong Wang, Bei Yu, ...
EDBT
2002
ACM
136views Database» more  EDBT 2002»
16 years 6 months ago
The Geometry of Uncertainty in Moving Objects Databases
Abstract. This work addresses the problem of querying moving objects databases. which capture the inherent uncertainty associated with the location of moving point objects. We addr...
Goce Trajcevski, Ouri Wolfson, Fengli Zhang, Sam C...
HASE
2008
IEEE
16 years 1 months ago
Low Cost Secure Computation for the General Client-Server Computation Model
Due to the large number of attacks on open networks, information theft becomes a more and more severe problem. Secure computation can offer highly assured confidentiality protecti...
Liangliang Xiao, I-Ling Yen, Farokh B. Bastani
IJCNN
2006
IEEE
16 years 18 days ago
Particle Swarm Optimization based Defensive Islanding of Large Scale Power System
— Defensive islanding is an efficient way to avoid catastrophic failures and wide area blackouts. Power system splitting especially for large scale power systems is a combinatori...
Wenxin Liu, David A. Cartes, Ganesh K. Venayagamoo...
ISCAS
2005
IEEE
129views Hardware» more  ISCAS 2005»
16 years 4 days ago
A reconfigurable architecture for scanning biosequence databases
—Unknown protein sequences are often compared to a set of known sequences (a database scan) to detect functional similarities. Even though efficient dynamic programming algorithm...
Timothy F. Oliver, Bertil Schmidt, Douglas L. Mask...