Sciweavers

32 search results - page 1 / 7
» View I O: Improving the Performance of Non-Contiguous I O
Sort
View
CHI
2010
ACM
13 years 10 months ago
O job can you return my mojo: improving human engagement and enjoyment in routine activities
Unlike machines, we humans are prone to boredom when we perform routine activities for long periods of time. Workers’ mental engagement in boring tasks diminishes, which eventua...
Dvijesh Shastri, Yuichi Fujiki, Ross Buffington, P...
ISSS
1997
IEEE
107views Hardware» more  ISSS 1997»
13 years 9 months ago
Port Calling: A Transformation for Reducing I/O during Multi-Package Functional Partitioning
Partitioning a system among multiple input and output pin I O limited packages is a widely researched and hard to solve problem. We previously described a new approach yielding ...
Frank Vahid
PPSN
1990
Springer
13 years 9 months ago
Feature Construction for Back-Propagation
T h e ease of learning concepts f r o m examples in empirical machine learning depends on the attributes used for describing the training d a t a . We show t h a t decision-tree b...
Selwyn Piramuthu
CIKM
2010
Springer
13 years 3 months ago
Multi-view clustering with constraint propagation for learning with an incomplete mapping between views
Multi-view learning algorithms typically assume a complete bipartite mapping between the different views in order to exchange information during the learning process. However, ma...
Eric Eaton, Marie desJardins, Sara Jacob
ICALP
2007
Springer
13 years 9 months ago
In-Place Suffix Sorting
Given string T = T[1, . . . , n], the suffix sorting problem is to lexicographically sort the suffixes T[i, . . . , n] for all i. This problem is central to the construction of suf...
Gianni Franceschini, S. Muthukrishnan