Sciweavers

2498 search results - page 47 / 500
» Data Structures with Unpredictable Timing
Sort
View
ESWA
2006
154views more  ESWA 2006»
14 years 9 months ago
Artificial neural networks with evolutionary instance selection for financial forecasting
In this paper, I propose a genetic algorithm (GA) approach to instance selection in artificial neural networks (ANNs) for financial data mining. ANN has preeminent learning abilit...
Kyoung-jae Kim
ICSE
1999
IEEE-ACM
15 years 2 months ago
Splitting the Organization and Integrating the Code: Conway's Law Revisited
It is widely acknowledged that coordination of large scale software development is an extremely difficult and persistent problem. Since the structure of the code mirrors the struc...
James D. Herbsleb, Rebecca E. Grinter
PVLDB
2010
123views more  PVLDB 2010»
14 years 8 months ago
Toward Scalable Keyword Search over Relational Data
Keyword search (KWS) over relational databases has recently received significant attention. Many solutions and many prototypes have been developed. This task requires addressing ...
Akanksha Baid, Ian Rae, Jiexing Li, AnHai Doan, Je...
WADS
2009
Springer
265views Algorithms» more  WADS 2009»
15 years 4 months ago
A Distribution-Sensitive Dictionary with Low Space Overhead
The time required for a sequence of operations on a data structure is usually measured in terms of the worst possible such sequence. This, however, is often an overestimate of the ...
Prosenjit Bose, John Howat, Pat Morin
JCDCG
2000
Springer
15 years 1 months ago
Volume Queries in Polyhedra
We present a simple and practical data structure for storing a (not necessarily convex) polyhedron P which can, given a query surface S cutting the polyhedron, determine the volume...
John Iacono, Stefan Langerman