Sciweavers

1675 search results - page 214 / 335
» The Value of a Good Name
Sort
View
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
14 years 1 months ago
Complexity Theory for Operators in Analysis
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
Akitoshi Kawamura and Stephen Cook
POPL
1999
ACM
14 years 1 months ago
Types for Mobile Ambients
An ambient is a named cluster of processes and subambients, which moves as a group. We describe type systems able to guarantee that certain ambients will remain immobile, and that ...
Luca Cardelli, Andrew D. Gordon
BIBE
2007
IEEE
141views Bioinformatics» more  BIBE 2007»
14 years 27 days ago
Graph and Topological Structure Mining on Scientific Articles
In this paper, we investigate a new approach for literature mining. We use frequent subgraph mining, and its generalization topological structure mining, for finding interesting re...
Fan Wang, Ruoming Jin, Gagan Agrawal, Helen Piontk...
C5
2004
IEEE
14 years 19 days ago
Skeleton - Easy Simulation System
Skeleton is a visual scripting environment as an extension of Squeak etoy [1] with Connectors [2] system to make mathematical and physical simulation for non professional computer...
Takashi Yamamiya
ESA
2008
Springer
102views Algorithms» more  ESA 2008»
13 years 10 months ago
Succinct Representations of Arbitrary Graphs
Abstract. We consider the problem of encoding a graph with n vertices and m edges compactly supporting adjacency, neighborhood and degree queries in constant time in the log n-bit ...
Arash Farzan, J. Ian Munro