Sciweavers

1747 search results - page 108 / 350
» Long Range Dependence
Sort
View
ICIS
2003
15 years 6 months ago
Defining Open Source Software Project Success
Information systems success is one of the most widely used dependent variables in information systems research. In this paper, we identify a range of measures that can be used to ...
Kevin Crowston, Hala Annabi, James Howison
156
Voted
ACL
1997
15 years 6 months ago
Retrieving Collocations by Co-occurrences and Word Order Constraints
In this paper, we describe a method for automatically retrieving collocations from large text corpora. This method retrieve collocations in the following stages: 1) extracting str...
Sayori Shimohata, Toshiyuki Sugio, Junji Nagata
DAGSTUHL
1997
15 years 6 months ago
Interpolation and Approximation of Surfaces from Three-dimensional Scattered Data Points
There is a wide range of applications for which surface interpolation or approximation from scattered data points in space is important. Dependent on the field of application and...
Robert Mencl, Heinrich Müller
CCS
2010
ACM
15 years 5 months ago
DieHarder: securing the heap
Heap-based attacks depend on a combination of memory management errors and an exploitable memory allocator. We analyze a range of widely-deployed memory allocators, including thos...
Gene Novark, Emery D. Berger
CPC
2008
135views more  CPC 2008»
15 years 5 months ago
Subtree Sizes in Recursive Trees and Binary Search Trees: Berry-Esseen Bounds and Poisson Approximations
We study the number of subtrees on the fringe of random recursive trees and random binary search trees whose limit law is known to be either normal or Poisson or degenerate depend...
Michael Fuchs