Sciweavers

9842 search results - page 1778 / 1969
» Problem complexity
Sort
View
DASFAA
2008
IEEE
188views Database» more  DASFAA 2008»
16 years 27 days ago
Summarization Graph Indexing: Beyond Frequent Structure-Based Approach
Graph is an important data structure to model complex structural data, such as chemical compounds, proteins, and XML documents. Among many graph data-based applications, sub-graph ...
Lei Zou, Lei Chen 0002, Huaming Zhang, Yansheng Lu...
181
Voted
INFOCOM
2007
IEEE
16 years 22 days ago
Near-Optimal Data Dissemination Policies for Multi-Channel, Single Radio Wireless Sensor Networks
Abstract—We analyze the performance limits of data dissemination with multi-channel, single radio sensors. We formulate the problem of minimizing the average delay of data dissem...
David Starobinski, Weiyao Xiao, Xiangping Qin, Ari...
IPPS
2007
IEEE
16 years 22 days ago
Max-Min Fair Bandwidth Allocation Algorithms for Packet Switches
With the rapid development of broadband applications, the capability of networks to provide quality of service (QoS) has become an important issue. Fair scheduling algorithms are ...
Deng Pan, Yuanyuan Yang
LANOMS
2007
IEEE
172views Education» more  LANOMS 2007»
16 years 21 days ago
Implementing and Deploying Network Monitoring Service Oriented Architectures
—Recently there is a growing interest in accessing network measurement and status data across multiple domains, in order to detect eventual network problems which can hinder the ...
Leobino Nascimento Sampaio, Ivo Koga, Rafael Costa...
ASIACRYPT
2007
Springer
16 years 18 days ago
When e-th Roots Become Easier Than Factoring
We show that computing e-th roots modulo n is easier than factoring n with currently known methods, given subexponential access to an oracle outputting the roots of numbers of the ...
Antoine Joux, David Naccache, Emmanuel Thomé...
« Prev « First page 1778 / 1969 Last » Next »