Sciweavers

3008 search results - page 385 / 602
» Independence in connected graphs
Sort
View
187
Voted
CG
2005
Springer
15 years 6 months ago
A freehand sketching interface for progressive construction of 3D objects
This paper presents an intuitive, freehand sketching application for Computer Aided Design (CAD) that can reconstruct a 3D object from a single, flat, freehand sketch. A pen is us...
Mark Masry, Dong Joong Kang, Hod Lipson
AINA
2010
IEEE
15 years 3 months ago
Neural Network Trainer through Computer Networks
- This paper introduces a neural network training tool through computer networks. The following algorithms, such as neuron by neuron (NBN) [1][2], error back propagation (EBP), Lev...
Nam Pham, Hao Yu, Bogdan M. Wilamowski
205
Voted
CORR
2011
Springer
169views Education» more  CORR 2011»
15 years 1 months ago
Upper Bounds for Maximally Greedy Binary Search Trees
At SODA 2009, Demaine et al. presented a novel connection between binary search trees (BSTs) and subsets of points on the plane. This connection was independently discovered by Der...
Kyle Fox
198
Voted
CORR
2011
Springer
165views Education» more  CORR 2011»
15 years 1 months ago
From IF to BI: a tale of dependence and separation
We take a fresh look at the logics of informational dependence and independence of Hintikka and Sandu and V¨a¨an¨anen, and their compositional semantics due to Hodges. We show h...
Samson Abramsky, Jouko A. Väänänen
CORR
2011
Springer
177views Education» more  CORR 2011»
15 years 1 months ago
Measuring NUMA effects with the STREAM benchmark
Modern high-end machines feature multiple processor packages, each of which contains multiple independent cores and integrated memory controllers connected directly to dedicated ph...
Lars Bergstrom