Sciweavers

2714 search results - page 302 / 543
» On the Notion of Value Object
Sort
View
ICALP
2011
Springer
14 years 10 months ago
New Algorithms for Learning in Presence of Errors
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...
Sanjeev Arora, Rong Ge
FSTTCS
2009
Springer
16 years 1 months ago
Fractional Pebbling and Thrifty Branching Programs
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
Mark Braverman, Stephen A. Cook, Pierre McKenzie, ...
POPL
2008
ACM
16 years 7 months ago
Automatic inference of stationary fields: a generalization of java's final fields
Java programmers can document that the relationship between two objects is unchanging by declaring the field that encodes that relationship to be final. This information can be us...
Christopher Unkel, Monica S. Lam
MICCAI
1998
Springer
15 years 11 months ago
Constrained Elastic Surface Nets: Generating Smooth Surfaces from Binary Segmented Data
This paper describes a method for creating object surfaces from binary-segmented data that are free from aliasing and terracing artifacts. In this method, a net of linked surface n...
Sarah F. Frisken Gibson
VLDB
1998
ACM
127views Database» more  VLDB 1998»
15 years 11 months ago
Algorithms for Mining Association Rules for Binary Segmentations of Huge Categorical Databases
We consider the problem of finding association rules that make nearly optimal binary segmentations of huge categorical databases. The optimality of segmentation is defined by an o...
Yasuhiko Morimoto, Takeshi Fukuda, Hirofumi Matsuz...