Sciweavers

1389 search results - page 164 / 278
» Definability as hypercomputational effect
Sort
View
PLDI
2010
ACM
14 years 7 months ago
The Reachability-Bound Problem
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
Sumit Gulwani, Florian Zuleger
WISE
2009
Springer
14 years 7 months ago
Formal Identification of Right-Grained Services for Service-Oriented Modeling
Identifying the right-grained services is important to lead the successful service orientation because it has a direct impact on two major goals: the composability of loosely-coupl...
Yukyong Kim, Kyung-Goo Doh
CVPR
2010
IEEE
14 years 6 months ago
Reading Between The Lines: Object Localization Using Implicit Cues from Image Tags
Current uses of tagged images typically exploit only the most explicit information: the link between the nouns named and the objects present somewhere in the image. We propose to ...
Sung Ju Hwang, University of Texas, Kristen Grauma...
HICSS
2010
IEEE
224views Biometrics» more  HICSS 2010»
14 years 4 months ago
Finding Success in Rapid Collaborative Requirements Negotiation Using Wiki and Shaper
Defining requirements without satisfying success critical stakeholders often leads to expensive project failures. Enabling interdisciplinary stakeholders to rapidly and effectivel...
Di Wu, Da Yang, Barry W. Boehm
ACIIDS
2009
IEEE
122views Database» more  ACIIDS 2009»
14 years 4 months ago
How to Maximize User Satisfaction Degree in Multi-service IP Networks
—Bandwidth allocation is a fundamental problem in communication networks. With current network moving towards the Future Internet model, the problem is further intensified as net...
Huy Anh Nguyen, Tam Van Nguyen, Deokjai Choi