Sciweavers

503 search results - page 86 / 101
» Verifying Quantitative Properties Using Bound Functions
Sort
View
172
Voted
POPL
2008
ACM
15 years 10 months ago
Cyclic proofs of program termination in separation logic
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
James Brotherston, Richard Bornat, Cristiano Calca...
VTC
2006
IEEE
114views Communications» more  VTC 2006»
15 years 3 months ago
A Scheduling Scheme under a Ratio Constraint for the Multiuser MIMO Systems
A scheduling scheme for MIMO systems which has the capability of obtaining multiuser diversity gain and controlling the link connection ratio among users simultaneously is proposed...
Jiwon Kang, Hakju Lee, Chungyong Lee, Young Yong K...
CVPR
2007
IEEE
15 years 11 months ago
Pyramid Match Hashing: Sub-Linear Time Indexing Over Partial Correspondences
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
Kristen Grauman, Trevor Darrell
ASM
2004
ASM
15 years 3 months ago
Observations on the Decidability of Transitions
Consider a multiple-agent transition system such that, for some basic types T1, . . . , Tn, the state of any agent can be represented as an element of the Cartesian product T1 ×·...
Yuri Gurevich, Rostislav Yavorskiy
86
Voted
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
15 years 2 months ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...