Sciweavers

26354 search results - page 363 / 5271
» How we refactor, and how we know it
Sort
View
DEBU
2002
116views more  DEBU 2002»
15 years 6 months ago
The Role of Web Services in Information Search
State-of-the-art Web search engines are inherently limited in their abilities to search information in Deep Web beyond portals. This paper discusses how Web services and Semantic-...
Jens Graupmann, Gerhard Weikum
SYNTHESE
2011
79views more  SYNTHESE 2011»
15 years 1 months ago
New life for Carnap's Aufbau?
Rudolf Carnap’s Der logische Aufbau der Welt (The Logical Structure of the World) is generally conceived of as being the failed manifesto of logical positivism. In this paper we...
Hannes Leitgeb
JMLR
2012
13 years 9 months ago
On Bisubmodular Maximization
Bisubmodularity extends the concept of submodularity to set functions with two arguments. We show how bisubmodular maximization leads to richer value-of-information problems, usin...
Ajit Singh, Andrew Guillory, Jeff Bilmes
CAV
2012
Springer
257views Hardware» more  CAV 2012»
13 years 9 months ago
CSolve: Verifying C with Liquid Types
We present CSolve, an automated verifier for C programs based on Liquid Type inference. We show how CSolve verifies memory safety through an example and describe its architecture...
Patrick Maxim Rondon, Alexander Bakst, Ming Kawagu...
206
Voted
IANDC
2008
141views more  IANDC 2008»
15 years 7 months ago
Graph connectivity, partial words, and a theorem of Fine and Wilf
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodi...