Sciweavers

675 search results - page 135 / 135
» Using Fairness to Make Abstractions Work
Sort
View
AO
2006
127views more  AO 2006»
13 years 6 months ago
Formal ontology meets industry
in ontology is quite abstract and often based on toy-examples to the point that the gap between the work of theoreticians and the needs of real applications is too wide to be cross...
Stefano Borgo, Matteo Cristani, Roberta Cuel
SAC
2008
ACM
13 years 5 months ago
Model-driven development of component-based adaptive distributed applications
This paper introduces an approach to develop componentbased adaptive distributed applications. Our approach separates the communication and the functional aspects of a distributed...
An Phung-Khac, Antoine Beugnard, Jean-Marie Gillio...
INTERNET
2010
170views more  INTERNET 2010»
13 years 4 months ago
Developing RESTful Web Services with Webmachine
bstractions and mechanisms Webmachine supplies to RESTful Web services developers. Not Your Typical Framework Web services frameworks typically fall into one of the following broad...
Justin Sheehy, Steve Vinoski
INFOCOM
2010
IEEE
13 years 3 months ago
Distributed Coordination with Deaf Neighbors: Efficient Medium Access for 60 GHz Mesh Networks
Multi-gigabit outdoor mesh networks operating in the unlicensed 60 GHz "millimeter (mm) wave" band, offer the possibility of a quickly deployable broadband extension of t...
Sumit Singh, Raghuraman Mudumbai, Upamanyu Madhow
FUN
2010
Springer
312views Algorithms» more  FUN 2010»
13 years 10 months ago
On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching
Given a string s, the Parikh vector of s, denoted p(s), counts the multiplicity of each character in s. Searching for a match of Parikh vector q (a “jumbled string”) in the tex...
Peter Burcsi, Ferdinando Cicalese, Gabriele Fici, ...