Sciweavers

11211 search results - page 1978 / 2243
» Rank-Sensitive Data Structures
Sort
View
139
Voted
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
15 years 9 months ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
Daniel Sawitzki
ACMICEC
2004
ACM
205views ECommerce» more  ACMICEC 2004»
15 years 9 months ago
M-Modeler: a framework implementation for modeling m-commerce applications
At the present time, the use of mobile technology in business, is becoming an opportunity to generate competitive advantages within organization environments. Mobile technology he...
Ana Hilda Morales-Aranda, Oscar Mayora-Ibarra, San...
102
Voted
COMPGEOM
2004
ACM
15 years 9 months ago
The corner arc algorithm
In a landmark survey of visibility algorithms in 1974, Sutherland, Sproull, and Schumacker stated that “We believe the principal untapped source of help for hidden surface algor...
Olaf A. Hall-Holt
112
Voted
CSCW
2004
ACM
15 years 9 months ago
Behind the help desk: evolution of a knowledge management system in a large organization
This paper examines the way in which a knowledge management system (KMS)—by which we mean the people, processes and software—came into being and evolved in response to a varie...
Christine Halverson, Thomas Erickson, Mark S. Acke...
145
Voted
MM
2004
ACM
248views Multimedia» more  MM 2004»
15 years 9 months ago
Incremental semi-supervised subspace learning for image retrieval
Subspace learning techniques are widespread in pattern recognition research. They include Principal Component Analysis (PCA), Locality Preserving Projection (LPP), etc. These tech...
Xiaofei He
« Prev « First page 1978 / 2243 Last » Next »