Sciweavers

7047 search results - page 1310 / 1410
» Focusing on Binding and Computation
Sort
View
MOBIHOC
2005
ACM
14 years 9 months ago
Distributed dynamic scheduling for end-to-end rate guarantees in wireless ad hoc networks
Abstract-We present a novel framework for the provision of deterministic end-to-end bandwidth guarantees in wireless ad hoc networks. Guided by a set of local feasibility condition...
Theodoros Salonidis, Leandros Tassiulas
MOBIHOC
2002
ACM
14 years 9 months ago
On using the ad-hoc network model in cellular packet data networks
While several approaches have been proposed in literature for improving the performance of wireless packet data networks, a recent class of approaches has focused on improving the...
Hung-Yun Hsieh, Raghupathy Sivakumar
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
14 years 7 months ago
Counting Stars and Other Small Subgraphs in Sublinear Time
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Mira Gonen, Dana Ron, Yuval Shavitt
ICDE
2010
IEEE
434views Database» more  ICDE 2010»
14 years 7 months ago
Progressive Result Generation for Multi-Criteria Decision Support Queries
— Multi-criteria decision support (MCDS) is crucial in many business and web applications such as web searches, B2B portals and on-line commerce. Such MCDS applications need to r...
Elke A. Rundensteiner, Venkatesh Raghavan
SDM
2009
SIAM
170views Data Mining» more  SDM 2009»
14 years 7 months ago
Optimal Distance Bounds on Time-Series Data.
Most data mining operations include an integral search component at their core. For example, the performance of similarity search or classification based on Nearest Neighbors is ...
Michail Vlachos, Philip S. Yu, Suleyman S. Kozat
« Prev « First page 1310 / 1410 Last » Next »