Sciweavers

296 search results - page 46 / 60
» Restoring the popularity of computer science
Sort
View
ESOP
2009
Springer
15 years 3 months ago
An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
Hao Yuan, Patrick Th. Eugster
ACMICEC
2008
ACM
222views ECommerce» more  ACMICEC 2008»
15 years 1 months ago
A seller's perspective characterization methodology for online auctions
Online auction services have reached great popularity and revenue over the last years. A key component for this success is the seller. Few studies proposed analyzing how the selle...
Arlei Silva, Pedro Calais, Adriano M. Pereira, Fer...
PST
2004
15 years 21 days ago
Familiarity and Trust: Measuring Familiarity with a Web Site
Abstract-- This work aims at measuring familiarity to contribute to the formalization of trust. Trust has always been bundled with familiarity to become a popular topic in the area...
Jie Zhang, Ali A. Ghorbani
AAAI
2000
15 years 20 days ago
Exploiting a Thesaurus-Based Semantic Net for Knowledge-Based Search
With the growth of on-line information, the need for better resource location services is growing rapidly. A popular goal is to conduct search in terms of concepts, rather than wo...
Peter Clark, John Thompson, Heather Holmback, Lisb...
SIGCSE
2008
ACM
141views Education» more  SIGCSE 2008»
14 years 11 months ago
Broadening participation through scalable game design
Game development is quickly gaining popularity in introductory programming courses. Motivational and educational aspects of game development are hard to balance and often sacrific...
Alexander Repenning, Andri Ioannidou