Sciweavers

4972 search results - page 340 / 995
» Ranking on graph data
Sort
View
175
Voted
ICCS
2007
Springer
15 years 10 months ago
A Comparison of Different Conceptual Structures Projection Algorithms
Knowledge representation (KR) is used to store and retrieve meaningful data. This data is saved using dynamic data structures that are suitable for the style of KR being implemente...
Heather D. Pfeiffer, Roger T. Hartley
ALT
1994
Springer
15 years 11 months ago
Program Synthesis in the Presence of Infinite Number of Inaccuracies
Most studies modeling inaccurate data in Gold style learning consider cases in which the number of inaccuracies is finite. The present paper argues that this approach is not reaso...
Sanjay Jain
STOC
2007
ACM
127views Algorithms» more  STOC 2007»
16 years 7 months ago
First to market is not everything: an analysis of preferential attachment with fitness
The design of algorithms on complex networks, such as routing, ranking or recommendation algorithms, requires a detailed understanding of the growth characteristics of the network...
Christian Borgs, Jennifer T. Chayes, Constantinos ...
SEFM
2005
IEEE
16 years 12 days ago
Description Logics for Shape Analysis
Verification of programs requires reasoning about sets of program states. In case of programs manipulating pointers, program states are pointer graphs. Verification of such prog...
Lilia Georgieva, Patrick Maier
PLDI
2004
ACM
16 years 7 days ago
Cost effective dynamic program slicing
Although dynamic program slicing was first introduced to aid in user level debugging, applications aimed at improving software quality, reliability, security, and performance hav...
Xiangyu Zhang, Rajiv Gupta