7811 search results - page 1149 / 1563 » computing 2004 |
124
click to vote
SAT
2004
Springer
15 years 10 months ago
2004
Springer
We propose and study a technique to improve the performance of those local-search SAT solvers that proceed by executing a prespecified number of tries, each starting with an eleme...
153
Voted
SEMWEB
2004
Springer
15 years 10 months ago
2004
Springer
P2P networks have become increasingly popular in the recent years. However, their open, distributed and anonymous nature makes them very vulnerable against malicious users who prov...
139
click to vote
VIZSEC
2004
Springer
15 years 10 months ago
2004
Springer
Most visualizations of security-related network data require large amounts of finely detailed, high-dimensional data. However, in some cases, the data available can only be coars...
139
click to vote
VLDB
2004
ACM
15 years 10 months ago
2004
ACM
When a client submits a set of XPath queries to a XML database on a network, the set of answer sets sent back by the database may include redundancy in two ways: some elements may...
130
Voted
GD
2003
Springer
15 years 10 months ago
2003
Springer
A graph with an ordered k-partition of the vertices is radial level planar if there is a strictly outward drawing on k concentric levels without crossings. Radial level planarity ...