190 search results - page 33 / 38 » A Simple Proof Technique for Certain Parametricity Results |
108
click to vote
CCR
2010
14 years 11 months ago
2010
The analysis of social and technological networks has attracted a lot of attention as social networking applications and mobile sensing devices have given us a wealth of real data...
155
Voted
PODS
2001
ACM
15 years 11 months ago
2001
ACM
The dimensionality curse has profound e ects on the effectiveness of high-dimensional similarity indexing from the performance perspective. One of the well known techniques for im...
157
click to vote
IWPEC
2010
Springer
14 years 9 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
100
click to vote
BMCBI
2010
14 years 11 months ago
2010
Background: Time-course microarray experiments can produce useful data which can help in understanding the underlying dynamics of the system. Clustering is an important stage in m...
ICFP
2003
ACM
15 years 11 months ago
2003
ACM
Program analysis is the heart of modern compilers. Most control flow analyses are reduced to the problem of finding a fixed point in a certain transition system, and such fixed po...