Sciweavers

10289 search results - page 1879 / 2058
» Standard bases in K
Sort
View
ATAL
2007
Springer
16 years 22 days ago
Scaling-up shopbots: a dynamic allocation-based approach
In this paper we consider the problem of eCommerce comparison shopping agents (shopbots) that are limited by capacity constraints. In light of the phenomenal increase both in dema...
David Sarne, Sarit Kraus, Takayuki Ito
CCS
2007
ACM
16 years 22 days ago
How much anonymity does network latency leak?
Low-latency anonymity systems such as Tor, AN.ON, Crowds, and Anonymizer.com aim to provide anonymous connections that are both untraceable by “local” adversaries who control ...
Nicholas Hopper, Eugene Y. Vasserman, Eric Chan-Ti...
CCS
2007
ACM
16 years 22 days ago
SecureBus: towards application-transparent trusted computing with mandatory access control
The increasing number of software-based attacks has attracted substantial efforts to prevent applications from malicious interference. For example, Trusted Computing (TC) technolo...
Xinwen Zhang, Michael J. Covington, Songqing Chen,...
CIE
2007
Springer
16 years 22 days ago
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
Michael R. Fellows, Frances A. Rosamond
CIKM
2007
Springer
16 years 22 days ago
Top-k subgraph matching query in a large graph
Recently, due to its wide applications, subgraph search has attracted a lot of attention from database and data mining community. Sub-graph search is defined as follows: given a ...
Lei Zou, Lei Chen 0002, Yansheng Lu
« Prev « First page 1879 / 2058 Last » Next »