Sciweavers

9842 search results - page 1917 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
ICSE
2007
IEEE-ACM
14 years 7 months ago
Revel8or: Model Driven Capacity Planning Tool Suite
Designing complex multi-tier applications that must meet strict performance requirements is a challenging software engineering problem. Ideally, the application architect could de...
Liming Zhu, Yan Liu, Ngoc Bao Bui, Ian Gorton
PERCOM
2006
ACM
14 years 7 months ago
Adaptive Medical Feature Extraction for Resource Constrained Distributed Embedded Systems
Tiny embedded systems have not been an ideal outfit for high performance computing due to their constrained resources. Limitations in processing power, battery life, communication ...
Roozbeh Jafari, Hyduke Noshadi, Majid Sarrafzadeh,...
MOBISYS
2006
ACM
14 years 7 months ago
ARIADNE: a dynamic indoor signal map construction and localization system
Location determination of mobile users within a building has attracted much attention lately due to its many applications in mobile networking including network intrusion detectio...
Yiming Ji, Saad Biaz, Santosh Pandey, Prathima Agr...
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
14 years 5 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
SPAA
2009
ACM
14 years 4 months ago
At-most-once semantics in asynchronous shared memory
Abstract. At-most-once semantics is one of the standard models for object access in decentralized systems. Accessing an object, such as altering the state of the object by means of...
Sotiris Kentros, Aggelos Kiayias, Nicolas C. Nicol...
« Prev « First page 1917 / 1969 Last » Next »