Sciweavers

297 search results - page 34 / 60
» Every Sequence Is Decompressible from a Random One
Sort
View
ICST
2010
IEEE
14 years 9 months ago
GraphSeq: A Graph Matching Tool for the Extraction of Mobility Patterns
Mobile computing systems provide new challenges for verification. One of them is the dynamicity of the system structure, with mobility-induced connections and disconnections, dynam...
Minh Duc Nguyen, Hélène Waeselynck, ...
COCO
2007
Springer
108views Algorithms» more  COCO 2007»
15 years 5 months ago
The Communication Complexity of Correlation
We examine the communication required for generating random variables remotely. One party Alice will be given a distribution D, and she has to send a message to Bob, who is then r...
Prahladh Harsha, Rahul Jain, David A. McAllester, ...
NLDB
2007
Springer
15 years 5 months ago
Treatment of Passive Voice and Conjunctions in Use Case Documents
Abstract. Requirements engineering, the first phase of any software development project, is the Achilles’ heel of the whole development process, as requirements documents are of...
Leonid Kof
BMCBI
2007
141views more  BMCBI 2007»
14 years 11 months ago
Artificial neural network models for prediction of intestinal permeability of oligopeptides
Background: Oral delivery is a highly desirable property for candidate drugs under development. Computational modeling could provide a quick and inexpensive way to assess the inte...
Eunkyoung Jung, Junhyoung Kim, Minkyoung Kim, Dong...
GIS
2009
ACM
16 years 2 days ago
Map-Matching for Low-Sampling-Rate GPS Trajectories
Map-matching is the process of aligning a sequence of observed user positions with the road network on a digital map. It is a fundamental pre-processing step for many applications...
Yin Lou, Chengyang Zhang, Yu Zheng, Xing Xie, Wei ...