Sciweavers

1626 search results - page 316 / 326
» Computing the Types of the Relationships between Autonomous ...
Sort
View
EDBT
2012
ACM
255views Database» more  EDBT 2012»
11 years 11 months ago
Top-k spatial keyword queries on road networks
With the popularization of GPS-enabled devices there is an increasing interest for location-based queries. In this context, one interesting problem is processing top-k spatial key...
João B. Rocha-Junior, Kjetil Nørv&ar...
ECOOPW
2000
Springer
14 years 28 days ago
Metadata and Adaptive Object-Models
Abstract. The unrelenting pace of change that confronts contemporary software developers compels them to make their applications more configurable, flexible, and adaptable. A way t...
Joseph W. Yoder, Reza Razavi
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
14 years 20 days ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
KBSE
2000
IEEE
14 years 4 days ago
Simultaneous Checking of Completeness and Ground Confluence
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...
Adel Bouhoula
RAID
2005
Springer
14 years 2 months ago
Polymorphic Worm Detection Using Structural Information of Executables
Abstract. Network worms are malicious programs that spread automatically across networks by exploiting vulnerabilities that affect a large number of hosts. Because of the speed at...
Christopher Krügel, Engin Kirda, Darren Mutz,...