Sciweavers

2907 search results - page 184 / 582
» Presentations of Structures in Admissible Sets
Sort
View
SODA
2008
ACM
150views Algorithms» more  SODA 2008»
15 years 8 months ago
Finding an optimal tree searching strategy in linear time
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...
Shay Mozes, Krzysztof Onak, Oren Weimann
143
Voted
ECIS
2004
15 years 8 months ago
Seeking legitimation for an information system: a preliminary process model
This research throws light on to the role of social issues in developing a successful information system. In a case study of a community health organization, we describe how IT ma...
Donal J. Flynn, Zahid Hussain
ESANN
2003
15 years 8 months ago
Self-organizing maps and functional networks for local dynamic modeling
The paper presents a method for times series prediction using a local dynamic modeling based on a three step process. In the first step the input data is embedded in a reconstruct...
Noelia Sánchez-Maroño, Oscar Fontenl...
NIPS
1998
15 years 7 months ago
Learning from Dyadic Data
Dyadic data refers to a domain with two nite sets of objects in which observations are made for dyads, i.e., pairs with one element from either set. This type of data arises natur...
Thomas Hofmann, Jan Puzicha, Michael I. Jordan
CGF
2008
98views more  CGF 2008»
15 years 6 months ago
Surface Reconstruction from Unorganized Point Data with Quadrics
We present a reverse engineering method for constructing a surface approximation scheme whose input is a set of unorganized noisy points in space and whose output is a set of quad...
Marek Vanco, Bernd Hamann, Guido Brunnett