Sciweavers

961 search results - page 107 / 193
» An Algorithm for Computing Semi-stable Semantics
Sort
View
PERVASIVE
2011
Springer
12 years 11 months ago
Identifying Important Places in People's Lives from Cellular Network Data
People spend most of their time at a few key locations, such as home and work. Being able to identify how the movements of people cluster around these “important places” is cru...
Sibren Isaacman, Richard Becker, Ramón C&aa...
JACM
2010
137views more  JACM 2010»
13 years 7 months ago
Reconciling description logics and rules
Description logics (DLs) and rules are formalisms that emphasize different aspects of knowledge representation: whereas DLs are focused on specifying and reasoning about conceptual...
Boris Motik, Riccardo Rosati
TACAS
2012
Springer
277views Algorithms» more  TACAS 2012»
12 years 4 months ago
Proving Reachability Using FShell - (Competition Contribution)
FShell is an automated white-box test-input generator for C programs, computing test data with respect to user-specified code coverage criteria. The pillars of FShell are the decl...
Andreas Holzer, Daniel Kroening, Christian Schallh...
ICDE
2009
IEEE
133views Database» more  ICDE 2009»
14 years 3 months ago
STAR: Steiner-Tree Approximation in Relationship Graphs
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
Gjergji Kasneci, Maya Ramanath, Mauro Sozio, Fabia...
POPL
2004
ACM
14 years 9 months ago
Global value numbering using random interpretation
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
Sumit Gulwani, George C. Necula