1120 search results - page 186 / 224 » time 1999 |
VLDB
1999
ACM
15 years 4 months ago
1999
ACM
Today’s object-relational DBMSs (ORDBMSs) are designed to support novel application domains by providing an extensible architecture, supplemented by domain-specific database ex...
97
Voted
WDAG
1999
Springer
15 years 4 months ago
1999
Springer
This short paper establishes lower bounds on the time complexity of algorithms solving the generic broadcast problem. The paper shows that (a) to deliver messages in one round, no...
122
click to vote
GD
1998
Springer
15 years 4 months ago
1998
Springer
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
121
Voted
HPCN
1998
Springer
15 years 4 months ago
1998
Springer
Unstructured grids can represent the complex geometry of the ocean basin with high delity. The lack of development tools supporting irregular grid problems discourages the use of ...
IADIS
2004
15 years 1 months ago
2004
The authors have been actively engaged in E-learning starting in 1996, at the College of Staten Island, CUNY, a public university in New York City, New York, U.S.A. and Shanghai T...